Higher-order matching for program transformation

Higher-order matching for program transformation

The tension between abstraction and efficiency in programming can be easedby program transformation; programs which are highly abstract and read-able, but inefficient, are automatically converted to efficient forms, allowingthe programmer to gain the advantages of having easy to understand andmaintainable source whilst also obtaining reasonable performance from thecompil...

Deterministic Higher-Order Patterns for Program Transformation

Algebraic Higher-Order Matching

The decidability of algebraic higher-order matching is proved. Algebraic higher-order matching is a matching where the constant term in equation is built of first-order constants and constants of a base type. This result is particularly appealing in the light of the last result of Loader.

Higher-Order Program Generation

This dissertation addresses the challenges of embedding programming languages, specializing generic programs to specific parameters, and generating specialized instances of programs directly as executable code. Our main tools are higher-order programming techniques and automatic program generation. It is our thesis that they synergize well in the development of customizable software. Recent res...

Decidability of higher-order matching

We show that the higher-order matching problem is decidable using a game-